منابع مشابه
Determining sets
We give several constructions of determining sets in various settings. We also demonstrate the connections between determining sets, skew karcs and linear codes of minimum distance 5. 1. Motivation. Let P be a non-empty set of elements which we shall call points. Let B be a non-empty set of subsets of P which we shall call blocks. We consider the use of a point/block system S = (P, B) in a mess...
متن کاملDetermining Sets, Resolving Sets, and the Exchange Property
A subset U of vertices of a graph G is called a determining set if every automorphism of G is uniquely determined by its action on the vertices of U . A subset W is called a resolving set if every vertex in G is uniquely determined by its distances to the vertices of W . Determining (resolving) sets are said to have the exchange property in G if whenever S and R are minimal determining (resolvi...
متن کاملFUZZY BOUNDED SETS AND TOTALLY FUZZY BOUNDED SETS IN I-TOPOLOGICAL VECTOR SPACES
In this paper, a new definition of fuzzy bounded sets and totallyfuzzy bounded sets is introduced and properties of such sets are studied. Thena relation between totally fuzzy bounded sets and N-compactness is discussed.Finally, a geometric characterization for fuzzy totally bounded sets in I- topologicalvector spaces is derived.
متن کاملSamurai Sword Sets Spindle Size
Although the parts list is nearly complete for many cellular structures, mechanisms that control their size remain poorly understood. Loughlin and colleagues now show that phosphorylation of a single residue of katanin, a microtubule-severing protein, largely accounts for the difference in spindle length between two closely related frogs.
متن کاملThe Size of Sets With
Let n be a nonzero integer and a1 < a2 < · · · < am positive integers such that aiaj + n is a perfect square for all 1 ≤ i < j ≤ m. It is known that m ≤ 5 for n = 1. In this paper we prove that m ≤ 31 for |n| ≤ 400 and m < 15.034 log |n| for |n| > 400.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2019
ISSN: 0012-365X
DOI: 10.1016/j.disc.2019.06.001